Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Identifieur interne : 006207 ( Main/Exploration ); précédent : 006206; suivant : 006208Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Auteurs : Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Vitaly Shmatikov [États-Unis] ; Mathieu Turuani [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Cryptographie.
English descriptors
- KwdEn :
Abstract
Abstract: We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a new probabilistic, polynomial-time semantics for an existing protocol security logic, replacing an earlier semantics that uses nondeterministic symbolic evaluation. While the basic form of the protocol logic remains unchanged from previous work, there are some interesting technical problems involving the difference between efficiently recognizing and efficiently producing a value, and involving a reinterpretation of standard logical connectives that seems necessary to support certain forms of reasoning.
Url:
DOI: 10.1007/11523468_2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002624
- to stream Istex, to step Curation: 002591
- to stream Istex, to step Checkpoint: 001521
- to stream Main, to step Merge: 006432
- to stream PascalFrancis, to step Corpus: 000546
- to stream PascalFrancis, to step Curation: 000492
- to stream PascalFrancis, to step Checkpoint: 000464
- to stream Main, to step Merge: 006601
- to stream Main, to step Curation: 006207
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Probabilistic Polynomial-Time Semantics for a Protocol Security Logic</title><author><name sortKey="Datta, Anupam" sort="Datta, Anupam" uniqKey="Datta A" first="Anupam" last="Datta">Anupam Datta</name></author><author><name sortKey="Derek, Ante" sort="Derek, Ante" uniqKey="Derek A" first="Ante" last="Derek">Ante Derek</name></author><author><name sortKey="Mitchell, John C" sort="Mitchell, John C" uniqKey="Mitchell J" first="John C." last="Mitchell">John C. Mitchell</name></author><author><name sortKey="Shmatikov, Vitaly" sort="Shmatikov, Vitaly" uniqKey="Shmatikov V" first="Vitaly" last="Shmatikov">Vitaly Shmatikov</name></author><author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A214C99D31EDE5523E540CDA21334854A6E4006E</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11523468_2</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-TW5B5NKH-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002624</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002624</idno><idno type="wicri:Area/Istex/Curation">002591</idno><idno type="wicri:Area/Istex/Checkpoint">001521</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001521</idno><idno type="wicri:doubleKey">0302-9743:2005:Datta A:probabilistic:polynomial:time</idno><idno type="wicri:Area/Main/Merge">006432</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:05-0337060</idno><idno type="wicri:Area/PascalFrancis/Corpus">000546</idno><idno type="wicri:Area/PascalFrancis/Curation">000492</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000464</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000464</idno><idno type="wicri:doubleKey">0302-9743:2005:Datta A:probabilistic:polynomial:time</idno><idno type="wicri:Area/Main/Merge">006601</idno><idno type="wicri:Area/Main/Curation">006207</idno><idno type="wicri:Area/Main/Exploration">006207</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Probabilistic Polynomial-Time Semantics for a Protocol Security Logic</title><author><name sortKey="Datta, Anupam" sort="Datta, Anupam" uniqKey="Datta A" first="Anupam" last="Datta">Anupam Datta</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Derek, Ante" sort="Derek, Ante" uniqKey="Derek A" first="Ante" last="Derek">Ante Derek</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Mitchell, John C" sort="Mitchell, John C" uniqKey="Mitchell J" first="John C." last="Mitchell">John C. Mitchell</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Shmatikov, Vitaly" sort="Shmatikov, Vitaly" uniqKey="Shmatikov V" first="Vitaly" last="Shmatikov">Vitaly Shmatikov</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Texas</region></placeName><wicri:cityArea>Dept. Computer Science, University of Texas, Austin</wicri:cityArea></affiliation></author><author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INRIA Nancy</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Asymptotic approximation</term><term>Automaton</term><term>Cryptography</term><term>Formal logic</term><term>Modeling</term><term>Non determinism</term><term>Polynomial time</term><term>Probabilistic approach</term><term>Safety</term><term>Semantics</term><term>Symbolic analysis</term><term>Transmission protocol</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Analyse symbolique</term><term>Approche probabiliste</term><term>Approximation asymptotique</term><term>Automate</term><term>Cryptographie</term><term>Logique formelle</term><term>Modélisation</term><term>Non déterminisme</term><term>Protocole transmission</term><term>Sécurité</term><term>Sémantique</term><term>Temps polynomial</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a new probabilistic, polynomial-time semantics for an existing protocol security logic, replacing an earlier semantics that uses nondeterministic symbolic evaluation. While the basic form of the protocol logic remains unchanged from previous work, there are some interesting technical problems involving the difference between efficiently recognizing and efficiently producing a value, and involving a reinterpretation of standard logical connectives that seems necessary to support certain forms of reasoning.</div></front></TEI><affiliations><list><country><li>France</li><li>États-Unis</li></country><region><li>Californie</li><li>Texas</li></region></list><tree><country name="États-Unis"><region name="Californie"><name sortKey="Datta, Anupam" sort="Datta, Anupam" uniqKey="Datta A" first="Anupam" last="Datta">Anupam Datta</name></region><name sortKey="Derek, Ante" sort="Derek, Ante" uniqKey="Derek A" first="Ante" last="Derek">Ante Derek</name><name sortKey="Mitchell, John C" sort="Mitchell, John C" uniqKey="Mitchell J" first="John C." last="Mitchell">John C. Mitchell</name><name sortKey="Shmatikov, Vitaly" sort="Shmatikov, Vitaly" uniqKey="Shmatikov V" first="Vitaly" last="Shmatikov">Vitaly Shmatikov</name></country><country name="France"><noRegion><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006207 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006207 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A214C99D31EDE5523E540CDA21334854A6E4006E
|texte= Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
}}
| This area was generated with Dilib version V0.6.33. |  |